On projections of free semialgebraic sets
نویسندگان
چکیده
Abstract We examine to what extent a projection theorem is possible in the non-commutative (free) setting. first review and extend some results that count against full free theorem. then obtain weak version of theorem: projections along linear separated variables yield semialgebraically parametrised semi-algebraic sets.
منابع مشابه
Matrix Convex Hulls of Free Semialgebraic Sets
This article resides in the realm of the noncommutative (free) analog of real algebraic geometry – the study of polynomial inequalities and equations over the real numbers – with a focus on matrix convex sets C and their projections Ĉ. A free semialgebraic set which is convex as well as bounded and open can be represented as the solution set of a Linear Matrix Inequality (LMI), a result which s...
متن کاملSemidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets
Given a compact semialgebraic set S ⊆ R, a polynomial map f : S → R, we consider the problem of approximating the image set F = f(S). This includes in particular the projections of S on R, for n ≥ m. Assuming that F ⊆ B, with B ⊆ R being a “simple” set (box or ellipsoid), we provide two methods (called Method 1 and Method 2) to compute certified outer approximations of F : — The first approach ...
متن کاملBetti Numbers of Semialgebraic Sets Defined by Quantifier-Free Formulae
Let X be a semialgebraic set inRn defined by a Boolean combination of atomic formulae of the kind h ∗ 0 where ∗ ∈ {>,≥,=}, deg(h) < d, and the number of distinct polynomials h is k. We prove that the sum of Betti numbers of X is less than O(k2d)n . Let an algebraic set X ⊂ Rn be defined by polynomial equations of degrees less than d. The well-known results of Oleinik, Petrovskii [8], [9], Milno...
متن کاملOptimization of Polynomials on Compact Semialgebraic Sets
A basic closed semialgebraic subset S of Rn is defined by simultaneous polynomial inequalities g1 ≥ 0, . . . , gm ≥ 0. We give a short introduction to Lasserre’s method for minimizing a polynomial f on a compact set S of this kind. It consists of successively solving tighter and tighter convex relaxations of this problem which can be formulated as semidefinite programs. We give a new short proo...
متن کاملOn Range Searching with Semialgebraic Sets
Let P be a set of n points in ~d (where d is a small fixed positive integer), and let F be a collection of subsets of ~d, each of which is defined by a constant number of bounded degree polynomial inequalities. We consider the following F-range searching problem: Given P, build a data structure for efficient answering of queries of the form, "Given a 7 ~ F, count (or report) the points of P lyi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Geometry
سال: 2023
ISSN: ['1615-715X', '1615-7168']
DOI: https://doi.org/10.1515/advgeom-2022-0021